passive suffix *-i̭á- in iranian languages

Complexity of Suffix-Free Regular Languages

We study various complexity properties of suffix-free regular languages. The quotient complexity of a regular language L is the number of left quotients of L; this is the same as the state complexity of L, which is the number of states in a minimal deterministic finite automaton (DFA) accepting L. A regular language L′ is a dialect of a regular language L if it differs only slightly from L (for...

Iranian Languages as Gardens

Rebootable and suffix - closed ω - power languages

The (ü-languages R» such that (1) Pref(7?)i? = 7?, (2) Suî(R) = R or (3) Pref^R") Suf (R*) = R* are characterized via properties of the language Stab (R) = { u e S* : u R <= R°} and via proper ties of (O-generators ofR®. Nicely, each char acier ïzation for (1) provides one for (2) and (3) by replacing "prefix" by "suffix" and "factor", respectively. Moreover (3) characterizes the (ö-languages R...

Passive in the world’s languages

In this chapter we shall examine the characteristic properties of a construction wide-spread in the world’s languages, the passive. In section 1 below we discuss defining characteristics of passives, contrasting them with other foregrounding and backgrounding constructions. In section 2 we present the common syntactic and semantic properties of the most wide-spread types of passives, and in sec...

Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages

A language L over an alphabet Σ is suffix-convex if, for any words x, y, z ∈ Σ∗, whenever z and xyz are in L, then so is yz. Suffixconvex languages include three special cases: left-ideal, suffix-closed, and suffix-free languages. We examine complexity properties of these three special classes of suffix-convex regular languages. In particular, we study the quotient/state complexity of boolean o...

Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages

The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of prefix-, suffix-, and bifix-free regular languages. We prove th...